Generalized Pair Weights of Linear Codes and Linear Isomorphisms Preserving Pair Weights
نویسندگان
چکیده
In this paper, we introduce the notion of generalized pair weights an $[n, k]$ -linear code over finite field notation="LaTeX">$\mathbb {F}_{q}$ and notation="LaTeX">$r$ -equiweight codes, where notation="LaTeX">$1\le r\le k-1$ . Some basic properties linear codes fields are derived. We obtain a necessary sufficient condition for notation="LaTeX">$[n,k]$ to be equiweight code, characterize any A isomorphism preserve between two is obtained. At end application symbol-pair read wire-tap channels type II introduced.
منابع مشابه
Generalized Hamming weights for linear codes
Error control codes are widely used to increase the reliability of transmission of information over various forms of communications channels. The Hamming weight of a codeword is the number of nonzero entries in the word; the weights of the words in a linear code determine the error-correcting capacity of the code. The rth generalized Hamming weight for a linear code C, denoted by dr(C), is the ...
متن کاملLinear codes and weights
Let F be a finite field with q elements. A k dimensional subspace C of the vector space Fn of all n-tuples over F is called a linear code of length n and dimension k. Algebraically, C is just a k-dimensional vector space over F. However, as a particular subspace of Fn, C inherits some metric properties. Specifically, for every v E Fn, the weight of v, denoted by wt( v), is defined to be the num...
متن کاملGeneralized Hamming weights of a class of linear codes
In [22], Kelan Ding and Cunsheng Ding presented a class of linear codes and determined their weight distributions. In this paper, we focus on the generalized Hamming weights of these codes. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting results about subspaces and their dual spaces. On this basis, we solve all the generalized Hamming w...
متن کاملGeneralized Hamming weights of three classes of linear codes
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the generalized Hamming weights of three classes of linear codes constructed through defining sets and determine them partly for some cases. Particularly, in the s...
متن کاملDuality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of a generator matrix as projective points. Projective multisets have proved very powerful in the study of generalised Hamming weights. In this paper we study relations between a code and its dual.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3120229